/*
	将顺序表的所有元素逆置，空间复杂度为O(1),需要判断奇偶性，单数和复数的for循环中间的边界值有差异
*/
#include<stdio.h>
#include"../Sequence_List/zyf_SqList"

void Reverse_Lsit(SqList *L)
{
	for (int i =0;i < length/2 ; i++)
	{
		int tmp;
		tmp = L -> elem_array[i];
		L -> elem_array[i] = L -> length[length-1-i];
		L -> length[length-1-i] = tmp;
	}
}